Best Practices Agent Patterns for On-Line Auctions
نویسندگان
چکیده
Today high volume of goods and services is being traded using online auction systems. The growth in size and complexity of architectures to support online auctions requires the use of distributed and cooperative software techniques. In this context, the agent software development paradigm seems appropriate both for their modelling, development and implementation. This paper proposes an agent-oriented patterns analysis of best practices for online auction. The patterns are intended to help both IT managers and software engineers during the requirement specification of an on-line auction system while integrating benefits of agent software engineering.
منابع مشابه
Multi-Agent Patterns for Deploying Online Auctions
Today, a high volume of goods and services is being traded using online auction systems. The growth in size and complexity of architectures to support online auctions requires the use of distributed and cooperative software techniques. In this context, the agent software development paradigm seems appropriate for their modeling, development, and implementation. This article proposes an agent-or...
متن کاملAccounting for Cognitive Costs in On - lineAuction
Many auction mechanisms, including rst and second price ascending and sealed bid auctions, have been proposed and analyzed in the economics literature. We compare the usefulness of diierent mechanisms for on-line auctions, focusing on the cognitive costs placed on users (e.g. the cost of determining the value of a good), the possibilities for agent mediation, and the trust properties of the auc...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملITERATIVE COMBINATORIAL AUCTIONS : ACHIEVING ECONOMIC AND COMPUTATIONALEFFICIENCYDavid
ITERATIVE COMBINATORIAL AUCTIONS: ACHIEVING ECONOMIC AND COMPUTATIONAL EFFICIENCY David Christopher Parkes Supervisor: Lyle H. Ungar This thesis presents new auction-based mechanisms to coordinate systems of selfinterested and autonomous agents, and new methods to design such mechanisms and prove their optimality. Computation is increasingly carried out on open networks, with self-interested pr...
متن کاملCost and Trust Issues in On-Line Auctions
Many auction mechanisms, including rst and second-price ascending and sealed-bid auctions, have been proposed and analyzed in the economics literature. We compare the usefulness of di erent mechanisms for on-line auctions, focusing on the di erent costs of determining reservation prices, determining bids and communicating bids, and on whether the auctioneer is trusted. Di erent auction formats ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005